Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
نویسندگان
چکیده
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. Whereas neighborhood exploration procedures are well-developed for problems with individual services, their counterparts one-to-one pickup-and-delivery more scarcely studied. A direct extension classic neighborhoods often inefficient or complex because the necessity jointly considering service pairs. To circumvent these issues, we introduce major improvements to existing searches problem new large neighborhoods. We show that Relocate Pair can be fully explored in [Formula: see text] instead time. adapt 4-Opt Balas–Simonetti consider precedence constraints. Moreover, an exponential-size called 2k-Opt, which includes all solutions generated by multiple nested 2-Opts searched time using dynamic programming. conduct extensive computational experiments, highlighting significant contribution speedup strategies within two classical Notably, our approach permits us repeatedly solve small instances optimality near-optimality milliseconds, therefore, it represents valuable tool time-critical applications, such as meal delivery mobility on demand.
منابع مشابه
A heuristic for the pickup and delivery traveling salesman problem
This paper deals with the pickup and delivery traveling salesman problem. First we show how to adapt some classical traveling salesman heuristics to solve this problem, then we propose a new and e$cient composite heuristic. The proposed heuristic is composed of two phases: a solution construction phase including a local optimization component and a deletion and re-insertion improvement phase. T...
متن کاملPerturbation heuristics for the pickup and delivery traveling salesman problem
The Traveling Salesman Problem with Pickup and Delivery (PDTSP) is considered. Seven perturbation heuristics are applied to instances ranging from 51 to 443 vertices. The main point of perturbation heuristics is to help a local search process to move away from a local optimum. The seven heuristics fall into three categories: Instance Perturbation (IP), Algorithmic Perturbation (AP), and Solutio...
متن کاملThe pickup and delivery traveling salesman problem with handling costs
This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...
متن کاملA branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be picked up, and a destination location where the load must be delivered. The problem consists of determining a shortest Hamiltonian cycle through all locations while ensuring that the pickup of each request is performed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2022
ISSN: ['0041-1655', '1526-5447']
DOI: https://doi.org/10.1287/trsc.2022.1176